Material-Force-Based Refinement Indicators in Adaptive Strategies
نویسندگان
چکیده
منابع مشابه
Strategies for hp-adaptive refinement
In the hp-adaptive version of the finite element method for solving partial differential equations, the grid is adaptively refined in both h, the size of the elements, and p, the degree of the piecewise polynomial approximation over the element. The selection of which elements to refine is determined by a local a posteriori error indicator, and is well established. But the determination of whet...
متن کاملAdaptive mesh refinement in CTH : Implementation of block - adaptive multi - material refinement and advection algorithms
An adaptive mesh refmement (AMR) version of CTH is currently under development. This project is being conducted jointly by researchers at the University of Texas and at Sandia National Laboratories. The AMR version of CTH represents a significant milestone in the ten-year development of this legacy code. CTH is a multi-material wave propagation code used by many analysts in the DoD user communi...
متن کاملOntology-Based Adaptive Query Refinement
Query refinement is the process of providing Web information seekers with alternative wordings for expressing their information needs. Although alternative query formulations may contribute to the improvement of retrieval results, nevertheless their realization by Web users is intrinsically limited in that alternative query wordings convey explicit information about neither their degree nor the...
متن کاملAdaptive Mesh Refinement Strategies for Immersed Boundary Methods
In the present study we propose an adaptive mesh refinement (AMR) strategy which can be coupled with embedded boundary methods in a straightforward manner. The building-block of the AMR solver is a structured Cartesian solver employed on a hierarchy of sub-grids. A fractional-step formulation is used for the time advancement, and all spatial derivatives are discretized on a staggered grid using...
متن کاملRefinement Tree Based Partitioning for Adaptive Grids
We present a new partitioning algorithm for grids obtained by adaptive reenement. The method uses the adaptive reenement tree to obtain information unavailable to other partitioning methods which use only the nal grid and/or some geometric data. The algorithm requires (typically) O(log(N)) operations after an O(N) preprocessing step. The method is guaranteed to produce perfectly balanced connec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2006
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200610191